Improved Bounds for Induced Poset Saturation
نویسندگان
چکیده
منابع مشابه
Exact bounds for some hypergraph saturation problems
Let Wn(p, q) denote the minimum number of edges in an n× n bipartite graph G on vertex sets X,Y that satisfies the following condition; one can add the edges between X and Y that do not belong to G one after the other so that whenever a new edge is added, a new copy of Kp,q is created. The problem of bounding Wn(p, q), and its natural hypergraph generalization, was introduced by Balogh, Bollobá...
متن کاملPoset-based Triangle: An Improved Alternative for Bilattice-based Triangle
Bilattice-based triangle provides elegant algebraic structure for reasoning with vague and uncertain information. But the truth and knowledge ordering of intervals in bilattice-based triangle can not deal with nonmonotonic reasoning and are not always intuitive. In this work, we construct an alternative algebraic structure, namely poset-based triangle and we provide with proper logical connecti...
متن کاملImproved bounds for stochastic matching
This results in this paper have been merged with the result in arXiv:1003.0167. The authors would like to withdraw this version. Please see arXiv:1008.5356 for the merged version.
متن کاملImproved Bounds for Testing Juntas
We consider the problem of testing functions for the property of being a k-junta (i.e., of depending on at most k variables). Fischer, Kindler, Ron, Safra, and Samorodnitsky (J. Comput. Sys. Sci., 2004 ) showed that Õ(k)/ queries are sufficient to test k-juntas, and conjectured that this bound is optimal for non-adaptive testing algorithms. Our main result is a non-adaptive algorithm for testin...
متن کاملImproved Bounds Computation for Probabilistic
Probabilistic is a direct extension of the structured singular value from the worst-case robustness analysis to the probabilistic framework. Instead of searching for the maximum of a function in the computation, computing probabilistic involves approximating the level surface of the function in the parameter space, which is even more complex. In particular, providing a suuciently tight upper bo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2020
ISSN: 1077-8926
DOI: 10.37236/8949